Testing preorders for probabilistic processes can be characterized by simulations
نویسندگان
چکیده
Transition systems are well-established as a semantic model for distributed systems with preorders that serve as criteria for reene-ment of a more abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failure rates, we need to extend models and methods that have proven successful for non-probabilistic systems to a probabilistic setting. In this paper, we develop a reenement preorder for a probabilistic extension of the transition systems model. The preoder is based on a notion of testing, of testing, where reenement corresponds to an improvement in the \worst-case" behavior of a process. The main of the paper result is that this preorder can be described by a notion of probabilistic simulation, which generalizes the standard simulation preorder for ordinary transition system. To our knowledge, this simulation preorder has not been previously described in the literature, and is strictly weaker than previously proposed simulations for probabilistic transition systems.
منابع مشابه
Characterisations of Testing Preorders for a Finite Probabilistic pi-Calculus
We consider two characterisations of the may and must testing preorders for a probabilistic extension of the finite π-calculus: one based on notions of probabilistic weak simulations, and the other on a probabilistic extension of a fragment of Milner-Parrow-Walker modal logic for the π-calculus. We base our notions of simulations on the similar concepts used in previous work for probabilistic C...
متن کاملCompositional Testing Preorders for Probabilistic Processes
Transition systems are well-established as a semantic model for distributed systems. There are widely accepted preorders that serve as criteria for reenement of a more abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failure rates, we need to extend models and methods that have proven successful for non-probabilistic systems to a probabilistic s...
متن کاملProbabilistic Extensions of Process Algebras ?
In this chapter, we adopt Probabilistic Transition Systems as a basic model for probabilistic processes, in which probabilistic and nondeter-ministic choices are independent concepts. The model is essentially a nondeterministic version of Markov decision processes or probabilistic automata of Rabin. We develop a general framework to deene proba-bilistic process languages to describe probabilist...
متن کاملTesting and Refinement for Nondeterministic and Probabilistic Processes
Transition systems are a basic semantic model for formal description , speciication, and analysis of concurrent and distributed systems. In order to describe and analyze aspects of reliability, such as the likelihood of trace and failure, this model has been extended in various ways to handle probabilistic behavior. To use these models for specii-cation and stepwise development of systems, it i...
متن کاملTesting Finitary Probabilistic Processes
We provide both modaland relational characterisations of mayand must-testing preorders for recursive CSP processes with divergence, featuring probabilistic as well as nondeterministic choice. May testing is characterised in terms of simulation, and must testing in terms of failure simulation. To this end we develop weak transitions between probabilistic processes, elaborate their topological pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 282 شماره
صفحات -
تاریخ انتشار 2002